منابع مشابه
Recursive subtyping revealed
Algorithms for checking subtyping between recursive types lie at the core of many programming language implementations. But the fundamental theory of these algorithms and how they relate to simpler declarative speci cations is not widely understood, due in part to the di culty of the available introductions to the area. This tutorial paper o ers an \end-to-end" introduction to recursive types a...
متن کاملSubtyping Recursive Games
Using methods drawn from Game Semantics, we build a sound and computationally adequate model of a simple calculus that includes both subtyping and recursive types. Our model solves recursive type equations up to equality, and is shown to validate a subtyping rule for recursive types proposed by Amadio and Cardelli.
متن کاملEecient Recursive Subtyping
Subtyping in the presence of recursive types for the calculus was studied by Amadio and Cardelli in In that paper they showed that the problem of deciding whether one recursive type is a subtype of another is decidable in exponential time In this paper we give an O n algorithm Our algorithm is based on a simpli cation of the de nition of the subtype relation which allows us to reduce the proble...
متن کاملSubtyping Recursive Types in Kernel Fun
The problem of defining and checking a subtype relation between recursive types was studied in [3] for a first order type system, but for second order systems, which combine subtyping and parametric polymorphism, only negative results are known [17]. This paper studies the problem of subtype checking for recursive types in system kernel Fun, a typed -calculus with subtyping and bounded second o...
متن کاملSubtyping Recursive Types Modulo Associative Commutative Products
We study subtyping of recursive types in the presence of associative and commutative products—that is, subtyping modulo a restricted form of type isomorphisms. We show that this relation, which we claim is useful in practice, is a composition of the usual subtyping relation with the recently proposed notion of equality up to associativity and commutativity of products, and we propose an efficie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Functional Programming
سال: 2002
ISSN: 0956-7968,1469-7653
DOI: 10.1017/s0956796802004318